Relativizations of Randomness and Genericity Notions
نویسندگان
چکیده
A set A is a base for Schnorr randomness if it is Turing reducible to a set R which is Schnorr random relative to A, and the notion of a base for weak 1-genericity can be defined similarly. We show that A is a base for Schnorr randomness if and only if A is a base for weak 1-genericity if and only if the halting set K is not Turing reducible to A. Furthermore, we define a set A to be high for Schnorr randomness versus Martin-Löf randomness if and only if every set that is Schnorr random relative to A is also Martin-Löf random unrelativized, and we show that A is high for Schnorr randomness versus Martin-Löf randomness if and only if K is Turing reducible to A. Results concerning highness for other pairs of randomness notions are also presented. Primary Mathematics Subject Classification: 03D32; Secondary Mathematics Subject Classification: 68Q30.
منابع مشابه
Generalized Vershik’s Theorem and Generic Metric Structures
We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in discriptive set theoretic (topological) sense and in measure theoretic sense. In particular, it gives a new perspective on Vershik’s theorems on genericity and randomness of Urysohn’s space among separable metric spaces.
متن کاملGeneric Separable Metric Structures
We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in descriptive set theoretic (topological) sense and in measure theoretic sense. In particular, it gives a new perspective on Vershik’s theorems on genericity and randomness of Urysohn’s space among separable metric spaces.
متن کاملResource-Bounded Balanced Genericity, Stochasticity and Weak Randomness
We introduce balanced t(n)-genericity which is a reenement of the genericity concept of Ambos-Spies, Fleischhack and Huwig 2] and which in addition controls the frequency with which a condition is met. We show that this concept coincides with the resource-bounded version of Church's stochasticity 6]. By uniformly describing these concepts and weaker notions of stochasticity introduced by Wilber...
متن کاملEffective genericity and differentiability
We prove that a real x is 1-generic if and only if every differentiable computable function has continuous derivative at x . This provides a counterpart to recent results connecting effective notions of randomness with differentiability. We also consider multiply differentiable computable functions and polynomial time computable functions. 2010 Mathematics Subject Classification 03E15; 03F60 (p...
متن کاملLowness for Weak Genericity and Randomness
We prove that lowness for weak genericity is equivalent to semicomputable traceability which is strictly between hyperimmune-freeness and computable traceability. We also show that semi-computable traceability implies lowness for weak randomness. These results refute a conjecture raised by several people.
متن کامل